home *** CD-ROM | disk | FTP | other *** search
/ Power Programmierung 2 / Power-Programmierung CD 2 (Tewi)(1994).iso / c / library / dos / diverses / leda / incl / point_se.h < prev    next >
Encoding:
C/C++ Source or Header  |  1991-11-15  |  2.1 KB  |  98 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  2.1.1                                                 11-15-1991
  4. +
  5. +
  6. +  point_set.h
  7. +
  8. +
  9. +  Copyright (c) 1991  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16.  
  17.  
  18.  
  19. #ifndef POINTSETH
  20. #define POINTSETH
  21.  
  22. #include <LEDA/d2_dictionary.h>
  23. #include <LEDA/plane.h>
  24. #include <LEDA/delaunay_tree.h>
  25.  
  26.  
  27. typedef DT_item   ps_item;
  28.  
  29. typedef list(DT_item) list(ps_item);
  30.  
  31.  
  32. declare3(d2_dictionary,real,real,DT_item)
  33.  
  34.  
  35.  
  36. class Point_Set : public delaunay_tree {
  37.  
  38. d2_dictionary(real,real,DT_item) T;
  39.  
  40. public:
  41.  
  42. Point_Set()  {}
  43.  
  44. ps_item       lookup(point);
  45.  
  46. list(ps_item) range_search(real, real, real, real);
  47.  
  48. list(point)   all_points();
  49.  
  50. ps_item       insert(point p, void* i);
  51.  
  52. ps_item       nearest_neighbor(point p){ return delaunay_tree::neighbor(p); }
  53.  
  54. void          change_inf(ps_item it, void* i) { delaunay_tree::change_inf(it,i);}
  55.  
  56. void          del(point p)             {  delaunay_tree::del(p);
  57.                                           T.del(p.xcoord(),p.ycoord());
  58.                                         }
  59.  
  60. void          del_item(ps_item it) { del(key(it)); }
  61.  
  62. list(ps_item) all_items();
  63. list(ps_item) convex_hull();
  64.  
  65.  
  66. void          clear()   { T.clear(); delaunay_tree::clear();  }
  67. int           size()    { return T.size(); }
  68. bool          empty()   { return T.empty(); }
  69.  
  70.  
  71. };
  72.  
  73.  
  74. #define point_set(itype) name2(itype,point_set)
  75.  
  76.  
  77. #define point_setdeclare(itype)\
  78. \
  79. class point_set(itype) : public Point_Set {\
  80. \
  81. void clear_inf(ent& x) { Clear(*(itype*)&x);    }\
  82. void copy_inf(ent& x)  { Copy(*(itype*)&x); }\
  83. \
  84. public:\
  85. \
  86. void    change_inf(ps_item it, itype i) { Point_Set::change_inf(it,Ent(i));  }\
  87. itype   inf(ps_item it)                 { return itype(Point_Set::inf(it));  }\
  88. ps_item insert(point p, itype i)        { return Point_Set::insert(p,Ent(i));}\
  89. \
  90.  point_set(itype)()   {}\
  91. ~point_set(itype)()   { clear(); }\
  92. };
  93.  
  94. #define forall_ps_items(i,D) forall(i, (D.all_items()) )
  95.  
  96. #endif
  97.  
  98.